Rewrite rule systems for modal propositional logic
نویسندگان
چکیده
منابع مشابه
Rewrite Rule Systems for Modal Propositional Logic
D This paper explains new results relating modal propositional logic and rewrite rule systems. More precisely, we give complete term rewriting systems for the modal propositional systems known as K, Q, T, and S5. These systems are presented as extensions of Hsiang’s system for classical propositional calculus. We have checked local confluence with the rewrite rule system K.B. (cf. the Knuth-Ben...
متن کاملModal Process Rewrite Systems
We consider modal transition systems with infinite state space generated by finite sets of rules. In particular, we extend process rewrite systems to the modal setting and investigate decidability of the modal refinement relation between systems from various subclasses. Since already simulation is undecidable for most of the cases, we focus on the case where either the refined or the refining p...
متن کاملPropositional Abduction in Modal Logic
In this work, the problem of performing abduction in modal logics is addressed, along the lines of 3], where a proof theoretical abduction method for full rst order classical logic is deened, based on tableaux and Gentzen-type systems. This work applies the same methodology to face modal abduction. The non-classical context enforces the value of analytical proof systems as tools to face the met...
متن کاملIntroduction to Modal Propositional Logic
The terminology and notation used here are introduced in the following papers: [15], [11], [2], [14], [16], [13], [7], [5], [6], [8], [10], [12], [1], [9], [3], [4], and [17]. For simplicity we follow a convention: x, y will be arbitrary, n, m, k will denote natural numbers, t1 will denote a tree decorated by [: , qua a non-empty set :], w, s, t will denote finite sequences of elements of , X w...
متن کاملAxiomatizations for Propositional and Modal Team Logic
A framework is developed that extends Hilbert-style proof systems for propositional and modal logics to comprehend their team-based counterparts. The method is applied to classical propositional logic and the modal logic K. Complete axiomatizations for their team-based extensions, propositional team logic PTL and modal team logic MTL, are presented. 1998 ACM Subject Classification F.4.1 Mathema...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1992
ISSN: 0743-1066
DOI: 10.1016/0743-1066(92)90028-2